Leader Election in Rings with Bounded Multiplicity (Short Paper)
نویسندگان
چکیده
We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings Kk with bounded multiplicity k ≥ 2. However, we show that process-terminating leader election is possible in the subclass U∗ ∩ Kk, where U ∗ is the class of rings which contain a process with a unique label.
منابع مشابه
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. Thus, the ABE model captures asynchrony that occurs in sensor networks and ad-hoc networks. At the example of an election algo...
متن کاملAsynchronous Bounded Expected Delay Networks
The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the ABE model requires only a bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all as...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملParameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, , comprised of finite, but arbitrarily many, copies of a template process . Unfortunately, it is undecidable in general [3]. In this paper, we consider the PMCP for systems comprised of processes arranged in a ring that communicate by passing messages via tokens whose ...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کامل